By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 13, Issue 1, pp. 1-308

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results

Christian Kanzow and Christian Nagel

pp. 1-23

BibTeX  Abstract Full Text:  PDF

Error Bounds for Abstract Linear Inequality Systems

Kung Fu Ng and Wei Hong Yang

pp. 24-43

BibTeX  Abstract Full Text:  PDF

On the Global Convergence of a Filter--SQP Algorithm

Roger Fletcher, Sven Leyffer, and Philippe L. Toint

pp. 44-59

BibTeX  Abstract Full Text:  PDF

Dual Stochastic Dominance and Related Mean-Risk Models

WLodzimierz Ogryczak and Andrzej Ruszczynski

pp. 60-78

BibTeX  Abstract Full Text:  PDF

New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization

U. M. García-Palomares and J. F. Rodríguez

pp. 79-96

BibTeX  Abstract Full Text:  PDF

On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization

Stefano Lucidi and Marco Sciandrone

pp. 97-116

BibTeX  Abstract Full Text:  PDF

Generalized Bundle Methods

Antonio Frangioni

pp. 117-156

BibTeX  Abstract Full Text:  PDF

On the Problem of Optimal Cutting

Dorin Bucur, Giuseppe Buttazzo, and Nicolas Varchon

pp. 157-167

BibTeX  Abstract Full Text:  PDF

A Multiplier Rule for Multiobjective Programming Problems with Continuous Data

Dinh The LUC

pp. 168-178

BibTeX  Abstract Full Text:  PDF

Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities

Jiming Peng, Cornelis Roos, and Tamás Terlaky

pp. 179-203

BibTeX  Abstract Full Text:  PDF

Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization

Satoru Iwata and Maiko Shigeno

pp. 204-211

BibTeX  Abstract Full Text:  PDF

Tubularity and Asymptotic Convergence of Penalty Trajectories in Convex Programming

T. Champion

pp. 212-227

BibTeX  Abstract Full Text:  PDF

Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification

Chong Li and Xiao-Qing Jin

pp. 228-239

BibTeX  Abstract Full Text:  PDF

Recursive Algorithms for Stock Liquidation: A Stochastic Optimization Approach

G. Yin, R. H. Liu, and Q. Zhang

pp. 240-263

BibTeX  Abstract Full Text:  PDF

A Class of Trust-Region Methods for Parallel Optimization

P. D. Hough and J. C. Meza

pp. 264-282

BibTeX  Abstract Full Text:  PDF

Block-Iterative Algorithms with Underrelaxed Bregman Projections

Yair Censor and Gabor T. Herman

pp. 283-297

BibTeX  Abstract Full Text:  PDF

On the Distance between Two Ellipsoids

Anhua Lin and Shih-Ping Han

pp. 298-308

BibTeX  Abstract Full Text:  PDF